Delay analysis of a place reservation queue with heterogeneous service requirements

We study the delay performance of a queue with a reservation-based priority scheduling mechanism. The objective is to provide a better quality of service to delay-sensitive packets at the cost of allowing higher delays for the best-effort packets. In our model, we consider a discrete-time single-server queue with general independent arrivals of class 1 (delay-sensitive) and class 2 (best-effort). The scheduling mechanism makes use of an in-queue reservation for a future arriving class-1 packet. A class-1 arrival takes the place of the reservation in the queue, after which a new reservation is created at the tail of the queue. Class-2 arrivals always take place at the end of the queue. Past work on place reservation queues assumed independent and identically distributed transmission times for both packet classes, either deterministically equal to one slot, geometrically distributed or with a general distribution. In contrast, we consider heterogeneous service requirements with class-dependent transmission-time distributions in our analysis. The key element in the analysis method for class-dependent transmission times is the use of a new Markovian system state vector consisting of the total amount of work in the queue in front of the reservation and the number of class-2 packets in the queue behind the reservation, at the beginning of a slot. Expressions are obtained for the probability generating functions, the mean values and the tail probabilities of the packet delays of both the delay-sensitive and the best-effort class. Numerical results illustrate that reservation-based scheduling mitigates the problem of packet starvation as compared to absolute priority scheduling

Session delay in file server output buffers with general session lengths

In this paper, we analyze the delay incurred by session-based traffic in the output buffer of a file server. Users can start and end sessions during which they are active and download information from the file server. Per time slot, each active user downloads a random but strictly positive number of information packets. Each session lasts for a random, yet again, strictly positive number of slots. We model the file server output buffer as a discrete-time infinite-capacity queueing system and we present an analytical technique to study the queueing delay for sessions in case of a general session-length distribution. The analysis method is based on the combination of a generating-functions approach with the use of an infinite-dimensional state description. As a result, a closed-form expression for the mean session delay is obtained. The analysis is illustrated with a numerical example, based on real traces of file server traffic

Performance analysis of buffers with train arrivals and correlated output interruptions

In this paper, we study a discrete-time buffer system with a timecorrelated packet arrival process and one unreliable output line. In particular, packets arrive to the buffer in the form of variable-length packet trains at a fixed rate of exactly one packet per slot. The packet trains are assumed to have a geometric length, such that each packet has a fixed probability of being the last of its corresponding train. The output line is governed by a Markovian process, such that the probability that the line is available during a slot depends on the state of the underlying J-state Markov process during that slot. First, we provide a general analysis of the state of the buffer system based on a matrix generating functions approach. This also leads to an expression for the mean buffer content. Additionally, we take a closer look at the distributions of the packet delay and the train delay. In order to make matters more concrete, we next present a detailed and explicit analysis of the buffer system in case the output line is governed by a 2-state Markov process. Some numerical examples help to visualise the influence of the various model parameters

Analysis of a discrete-time queueing system with an NT-policy

In this paper, we analyse a discrete-time single-server queue operating under the NT-policy, which aims at clustering the service of customers in order to reduce the number of server activations and deactivations. Starting from an empty queue, the service of arriving customers is postponed until either of two thresholds is reached. Specifically, exhaustive service of customers is initiated only if either N customers have accumulated (space threshold) or if more than slots have passed since the arrival of the first customer. This way, the queue cycles between three states, i.e. an empty phase, an accumulating phase and a serving phase. A Bernoulli arrival process and deterministic service times are assumed. We derive the steady-state probabilities of the system's state as well as the distributions of the phase sojourn times and the customer delay. For the latter, we condition on the phase during the customer's arrival slot. The influence of the model parameters on the results is discussed by means of a numerical example

Performance analysis of a priority queue with place reservation and general transmission times

In this paper, we analyze a discrete-time single-server queue with two classes of packet arrivals and a reservation-based scheduling discipline. The objective of this discipline is to give a certain priority to (delay-sensitive) packets of class 1 and at the same time to avoid packet starvation for the (delay-tolerant) packets of class 2. This is achieved by the introduction of a reserved place in the queue that can be taken by a future arrival of class 1. Both classes contain packets with generally distributed transmission times. By means of a probability generating functions approach, both the class-1 and the class-2 packet delay are studied. By some numerical examples, the delay performance of the Reservation discipline is compared to that of the classical Absolute Priority (AP) and First-In First-Out (FIFO) scheduling disciplines

The impact of the NT-policy on the behaviour of a discrete-time queue with general service times

In this paper, we analyse the behaviour of a discrete-time singleserver queueing system with general service times, equipped with the NTpolicy. This is a threshold policy designed to reduce the number of service unit activation/deactivation cycles, whilst ensuring an acceptable delay trade-off. Once the server is deactivated, reactivation will be postponed until either N customers have accumulated in the queue or the first customer has been in the queue for T slots, whichever happens first. Due to this modus operandi, the system circulates between three phases: empty, accumulating and serving. We assume a Bernoulli arrival process of customers and independent and identically distributed service times. Using a probability generating functions approach, we obtain expressions for the steady-state distributions of the phase sojourn times, the cycle length, the system content and the customer delay. The influence of the threshold parameters N and T on the mean sojourn times and the expected delay is discussed by means of numerical examples